A New Model for Multiparty Collaborative Distributed Mining using Bloom Filter

نویسنده

  • Deepak Joshy
چکیده

Collaborative pattern mining is a pattern mining technique used in a distributed environment where each site participate collaboratively with one another for the discovery of patterns. Each individual site is capable of mining patterns and can communicate with other sites in the distributed environment. Currently existing work have failed to tackle various problems using this technique like effective data exchange and cross-site pattern pruning mechanisms. This paper advocates an effective method to perform pattern pruning in a distributive manner with the help of a data structure called Bloom Filter. With its help cross site pattern pruning can be performed with minimized data transfer between the sites as well as increased speed and with the capability of mining Local, Global and Inter-database Patterns. Keywords— Distributed data mining, Bloom Filter, Frequent item set, Distributed associative rule mining

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approach for Privacy Preservation of Distributed Data in Peer-to-Peer Network using Multiparty Computation

Use of technology for data collection and analysis has seen an unprecedented growth in the last couple of decades. Individuals and organizations generate huge amount of data through everyday activities. This data is either centralized for pattern identification or mined in a distributed fashion for efficient knowledge discovery and collaborative computation. This has raised serious concerns abo...

متن کامل

Reduce to the Max: A Simple Approach for Massive-Scale Privacy-Preserving Collaborative Network Measurements (Extended Version)

Privacy-preserving techniques for distributed computation have been proposed recently as a promising framework in collaborative inter-domain network monitoring. Several different approaches exist to solve such class of problems, e.g., Homomorphic Encryption (HE) and Secure Multiparty Computation (SMC) based on Shamir’s Secret Sharing algorithm (SSS). Such techniques are complete from a computat...

متن کامل

Key Technologies and Applications of Secure Multiparty Computation

With the advent of the information age, the network security is particularly important. The secure multiparty computation is a very important branch of cryptography. It is a hotspot in the field of information security. It expanded the scope of the traditional distributed computing and information security, provided a new computing model for the network collaborative computing. First we introdu...

متن کامل

Recommendation System Using Bloom Filter in Mapreduce

Many clients like to use the Web to discover product details in the form of online reviews. The reviews are provided by other clients and specialists. Recommender systems provide an important response to the information overload problem as it presents users more practical and personalized information facilities. Collaborative filtering methods are vital component in recommender systems as they ...

متن کامل

A Cuckoo Filter Modification Inspired by Bloom Filter

Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014